Applications of parallel processing algorithms for DNA sequence analysis

Applications of parallel processing algorithms for DNA sequence analysis

Programs have been written to apply parallel processing algorithms to the main methods of DNA sequence analysis. These programs allow the largest of currently interesting problems to be handled on a medium-sized computer system. The abundance of information otherwise not readily available has suggested new methods for the detection of homology and order in sequences.

Parleda: a Library for Parallel Processing in Computational Geometry Applications

ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...

Efficient combinatorial algorithms for DNA sequence processing

The modern era of molecular biology began with the discovery of the double helical structure of DNA. Today, sequencing nucleic acids, the determination of genetic information at the most fundamental level, is a major tool of biological research [44]. This revolution in biology has created a huge amount of data at great speed by directly reading DNA sequences. The growth rate of data volume is e...

A Dataflow Analysis Tool for Parallel Processing of Algorithms

analysis of ruin probability for insurance companies using markov chain

در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...